Exposed points and extremal problems in $H^1$, II

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Problems and results in extremal combinatorics - II

Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoretical Computer Science, Geometry and Game Theory. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems suggested by various researchers. The topi...

متن کامل

Extremal Graph Problems, Degenerate Extremal Problems, and Supersaturated Graphs

Notation. Given a graph, hypergraph Gn, . . . , the upper index always denotes the number of vertices, e(G), v(G) and χ(G) denote the number of edges, vertices and the chromatic number of G respectively. Given a family L of graphs, hypergraphs, ex(n,L) denotes the maximum number of edges (hyperedges) a graph (hypergraph)Gn of order n can have without containing subgraphs (subhypergraphs) from L...

متن کامل

Extremal Problems in Digraphs

Let G be a finite simple directed graph on n vertices. Say G is m-free if it has no directed cycles of length at most m. In 1978, Caccetta and Häggkvist [3] conjectured that if G has minimum out-degree at least r, then G is not dn/re-free. Finding upper bounds on the minimum out-degree in 3-free digraphs has been of particular interest in recent research. In this thesis, we present new results ...

متن کامل

Extremal Problems for Geometric Hypergraphs 1 Extremal Problems for Geometric

A geometric hypergraph H is a collection of i-dimensional simplices, called hyperedges or, simply, edges, induced by some (i + 1)-tuples of a vertex set V in general position in d-space. The topological structure of geometric graphs, i.e., the case d = 2; i = 1, has been studied extensively, and it proved to be instrumental for the solution of a wide range of problems in combinatorial and compu...

متن کامل

Extremal points without compactness in L(μ)

We investigate the existence of extremal points and the KreinMIlman representation A = co ExtA of bounded convex subsets of L(μ) which are only closed with respect to the topology of μ -a.e. convergence.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Tohoku Mathematical Journal

سال: 1985

ISSN: 0040-8735

DOI: 10.2748/tmj/1178228683